package algorithm.leetcode.simple;

/*
 使用队列实现栈
 */

import java.util.LinkedList;
import java.util.Queue;

/**
 * @author jack.wu
 * @version 1.0
 * @date 2020/10/20
 */
public class Question225 {

    public static void main(String[] args) {

    }

    private class MyStack {

        Queue<Integer> queue;

        /**
         * Initialize your data structure here.
         */
        public MyStack() {
            queue = new LinkedList<>();
        }

        /**
         * Push element x onto stack.
         */
        public void push(int x) {
            int len = queue.size();
            queue.offer(x);
            for (int i = 0; i < len; i++) {
                queue.offer(queue.poll());
            }
        }

        /**
         * Removes the element on top of the stack and returns that element.
         */
        public int pop() {
            return queue.poll();
        }

        /**
         * Get the top element.
         */
        public int top() {
            return queue.peek();
        }

        /**
         * Returns whether the stack is empty.
         */
        public boolean empty() {
            return queue.isEmpty();
        }
    }
}
